A Short Survey on Arithmetic Transforms and the Arithmetic Hartley Transform
نویسندگان
چکیده
Arithmetic complexity has a main role in the performance of algorithms for spectrum evaluation. Arithmetic transform theory offers a method for computing trigonometrical transforms with minimal number of multiplications. In this paper, the proposed algorithms for the arithmetic Fourier transform are surveyed. A new arithmetic transform for computing the discrete Hartley transform is introduced: the Arithmetic Hartley transform. The interpolation process as the key to the arithmetic transform theory is also examined.
منابع مشابه
Interpolating in Arithmetic Transform Algorithms
In this paper, we propose a unified theory for arithmetic transforms of a variety of discrete trigonometric transforms. The main contribution of this work is the elucidation of the interpolation process required in arithmetic transforms. We show that the interpolation method determines the transform to be computed. Several kernels were examined and asymptotic interpolation formulae were derived...
متن کاملCyclic Convolution of Real Sequences: Hartley versus Fourier and New Schemes
Recently, new fast transforms (such as the discrete Hartley transform in particular) have been proposed which are best suited for the computation of cyclic convolution of real sequences. Two approaches using Fourier or Hartley transforms are first compared, showing that the recently proposed FFT algorithms for real data present a lower arithmetic complexity than the corresponding DHT-based appr...
متن کاملAn FPGA based parameterisable system for discrete Hartley transforms implementation
Discrete Hartley Transforms (DHTs) are very important in many types of applications including image enhancement, acoustics, optics, telecommunications and speech signal processing. Two novel architectures for computing DHTs using both systolic architecture and distributed arithmetic design methodologies are presented in this paper. The first approach uses the Modified Booth-encoder-Wallace tree...
متن کاملImproved Fourier and Hartley transform algorithms: Application to cyclic convolution of real data
This paper highlights the possible tradeoffs between arithmetic and structural complexity when computing cyclic convolution of real data in the transform domain. Both Fourier and Hartley-based schemes are first explained in their usual form and then improved, either from the structural point of view or in the number of operations involved. Namely, we first present an algorithm for the in-place ...
متن کاملLow-complexity transform and quantization with 16-bit arithmetic for H.26L
This paper presents an overview of the latest transform and quantization designs for H.26L. Unlike the popular discrete cosine transform (DCT) used in previous standards, the transforms in H.26L can be computed exactly in integer arithmetic, thus avoiding inverse transform mismatch problems. The new transforms can also be computed without multiplications, just additions and shifts, in 16-bit ar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1504.06106 شماره
صفحات -
تاریخ انتشار 2004